Polynomially Bounded Sequences and Polynomial Sequences
نویسندگان
چکیده
منابع مشابه
Polynomially Bounded Sequences and Polynomial Sequences
In this article, we formalize polynomially bounded sequences that plays an important role in computational complexity theory. Class P is a fundamental computational complexity class that contains all polynomial-time decision problems [11], [12]. It takes polynomially bounded amount of computation time to solve polynomial-time decision problems by the deterministic Turing machine. Moreover we fo...
متن کاملAlgebra of Polynomially Bounded Sequences and Negligible Functions
In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the ...
متن کاملConjugate Sequences, Bounded Complex Sequences and Convergent Complex Sequences
This article is a continuation of [1]. It is divided into five sections. The first one contains a few useful lemmas. In the second part there is a definition of conjugate sequences and proofs of some basic properties of such sequences. The third segment treats of bounded complex sequences,next one contains description of convergent complex sequences. The last and the biggest part of the article...
متن کاملPrime Polynomial Sequences
Let F(x) be a polynomial with integral coefficients of degree d >_ 2 such that F(n) >_ 1 for all it 3 1 . Let OF = {F(n)Í„ , . Then F(tr) is called prime in OF if F(u) is not the product of strictly smaller terms of &F . It is proved that if F(x) is not of the form a(bx+c)d, then almost all terms of (! r are prime in O F. Let 0 = be a sequence of positive integers . Then a,, E & is called compo...
متن کاملRecursive sequences and polynomial congruences
We consider the periodicity of recursive sequences defined by linear homogeneous recurrence relations of arbitrary order, when they are reduced modulo a positive integer m. We show that the period of such a sequence with characteristic polynomial f can be expressed in terms of the order of ω = x + f as a unit in the quotient ring ޚ m [ω] = ޚ m [x]/ f. When m = p is prime, this order can be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2015
ISSN: 1898-9934
DOI: 10.1515/forma-2015-0017